Tuple-based Coordination of Stochastic Systems with Uniform Primitives

نویسندگان

  • Stefano Mariani
  • Andrea Omicini
چکیده

Complex computational systems – such as pervasive, adaptive, and self-organising ones – typically rely on simple yet expressive coordination mechanisms: this is why coordination models and languages can be exploited as the sources of the essential abstractions and mechanisms to build such systems. While the features of tuple-based models make them well suited for complex system coordination, they lack the probabilistic mechanisms for modelling the stochastic behaviours typically required by adaptivity and self-organisation. To this end, in this paper we explicitly introduce uniform primitives as a probabilistic specialisation of standard tuple-based coordination primitives, replacing don’t know non-determinism with uniform distribution. We define their semantics and discuss their expressiveness and their impact on system predictability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Timed Coordination Primitives and Probabilistic Tuple Spaces

In this paper we present an integration of PLinda, a probabilistic extension of Linda, and StoKlaim, a stochastic extension of KLAIM. In the resulting language, StoPKlaim, the execution time of coordination primitives is modeled by means of exponentially distributed random variables, as in StoKlaim, the choice of the primitive to be executed among conflicting ones is thus resolved by the race c...

متن کامل

Bonita: A set of tuple space primitives for distributed coordination

In the last few years the use of distributed structured shared memory paradigms for coordination between parallel processes has become common. One of the most well known implementations of this paradigm is the shared tuple space model (as used in Linda). In this paper we describe a new set of primitives for fully distributed coordination of processes and agents using tuple spaces, called the Bo...

متن کامل

Using Asynchronous Tuple-Space Access Primitives (BONITA Primitives) for Process Co-ordination

In this paper an interactive talk program is used to demonstrate the diierence between the Linda primitives and the recently proposed Bonita primitives. Both use the concept of shared tuple spaces for inter-agent communication, but the Bonita primitives provide asyn-chronous tuple space access. The paper demonstrates the performance gains and the novel coordination patterns achievable using the...

متن کامل

Short Running Title: Wcl: a Co-ordination Language for Geographically Distributed Agents Wcl: a Co-ordination Language for Geographically Distributed Agents A. Rowstron, Wcl: a Co-ordination Language for Geographically Distributed Agents

In this paper a tuple space based co-ordination language, and a run-time system which supports it is described. The co-ordination language is called WCL, and it is designed to support agent co-ordination over the Internet between agents which are geographically distributed. WCL uses tuple spaces as used in Linda. WCL provides a richer set of primitives that traditional tuple space based systems...

متن کامل

Linda in Space-Time: An Adaptive Coordination Model for Mobile Ad-Hoc Environments

We present a vision of distributed system coordination as a set of activities affecting the space-time fabric of interaction events. In the tuple space setting that we consider, coordination amounts to control of the spatial and temporal configuration of tuples spread across the network, which in turn drives the behaviour of situated agents. We therefore draw on prior work in spatial computing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013